Minimal Polynomial Algorithms for Finite SequencesNORTON, Graham H.IEEE transactions on information theory. 2010, Vol 56, Num 9, pp 4643-4645, issn 0018-9448, 3 p.Article

On Decoding Complexity of Reed-Solomon Codes on the Packet Erasure ChannelGARRAMMONE, Giuliano.IEEE communications letters. 2013, Vol 17, Num 4, pp 773-776, issn 1089-7798, 4 p.Article

An Algorithm for Computing Minimal Bidirectional Linear Recurrence RelationsSALAGEAN, Ana.IEEE transactions on information theory. 2009, Vol 55, Num 10, pp 4695-4700, issn 0018-9448, 6 p.Article

Reducing the computation of linear complexities of periodic sequences over GF(p^m)HAO CHEN.IEEE transactions on information theory. 2006, Vol 52, Num 12, pp 5537-5539, issn 0018-9448, 3 p.Article

Coding Schemes for Crisscross Error PatternsPLASS, Simon; RICHTER, Gerd; HAN VINCK, A. J et al.Wireless personal communications. 2008, Vol 47, Num 1, pp 39-49, issn 0929-6212, 11 p.Conference Paper

A Future Simplification of Procedure for Decoding Nonsystematic Reed-Solomon Codes Using the Berlekamp-Massey AlgorithmLIN, Tsung-Ching; TRUONG, Trieu-Kien; CHANG, Hsin-Chiu et al.IEEE transactions on communications. 2011, Vol 59, Num 6, pp 1555-1562, issn 0090-6778, 8 p.Article

Fast Algebraic Decoding of the (89, 45, 17) Quadratic Residue CodeLIN, Tsung-Ching; SU, Wen-Ku; SHIH, Pei-Yu et al.IEEE communications letters. 2011, Vol 15, Num 2, pp 226-228, issn 1089-7798, 3 p.Article

On linear complexity of sequences over GF(2ⁿ)YOUSSEF, A. M; GONG, G.Theoretical computer science. 2006, Vol 352, Num 1-3, pp 288-292, issn 0304-3975, 5 p.Article

Parallel implementation of the Schur Berlekamp-Massey algorithm on a linearly connected procesor arrayZAROWSKI, C. J.IEEE transactions on computers. 1995, Vol 44, Num 7, pp 930-933, issn 0018-9340Article

New List Decoding Algorithms for Reed-Solomon and BCH CodesYINGQUAN WU.IEEE transactions on information theory. 2008, Vol 54, Num 8, pp 3611-3630, issn 0018-9448, 20 p.Article

Constructions of Nonbinary Quasi-Cyclic LDPC Codes : A Finite Field ApproachLINGQI ZENG; LAN LAN; TAI, Ying Y et al.IEEE transactions on communications. 2008, Vol 56, Num 4, pp 545-554, issn 0090-6778, 10 p.Article

Applications of Reed-Solomon codes in mobile digital video communications systemsLOKSHINA, Izabella.International journal of mobile network design and innovation (Print). 2011, Vol 3, Num 4, pp 204-208, issn 1744-2869, 5 p.Article

On Decoding of the (89, 45, 17) Quadratic Residue CodeLIN WANG; YONG LI; TRUONG, Trieu-Kien et al.IEEE transactions on communications. 2013, Vol 61, Num 3, pp 832-841, issn 0090-6778, 10 p.Article

VLSI Architectures for Soft-Decision Decoding of Reed―Solomon CodesAHMED, Arshad; KOETTER, Ralf; SHANBHAG, Naresh R et al.IEEE transactions on information theory. 2011, Vol 57, Num 2, pp 648-667, issn 0018-9448, 20 p.Article

Construction of Nonbinary Cyclic, Quasi-Cyclic and Regular LDPC Codes : A Finite Geometry ApproachLINGQI ZENG; LAN LAN; YING YU TAI et al.IEEE transactions on communications. 2008, Vol 56, Num 3, pp 378-387, issn 0090-6778, 10 p.Article

An algorithm for computing a shortest linear recurrence relation for a sequence of matrices : generalizing the Berlekamp-Massey algorithmKUIJPER, M; WILLEMS, J. C.IEEE international symposium on information theory. 1998, isbn 0-7803-5000-6, p. 441Conference Paper

Algebraic decoding of quadratic residue codes using berlekamp-massey algorithmCHEN, Y. H; TRUONG, T. K; CHANG, Y et al.Journal of information science and engineering. 2007, Vol 23, Num 1, pp 127-145, issn 1016-2364, 19 p.Article

An algorithm for t+1 error correction in reed- solomon codesEGOROV, S. I; MARKARIAN, G.IEEE International Conference on Communications. 2004, isbn 0-7803-8533-0, vol2, 651-655Conference Paper

On Rational Interpolation-Based List-Decoding and List-Decoding Binary Goppa CodesBEELEN, Peter; HØHOLDT, Tom; NIELSEN, Johan S. R et al.IEEE transactions on information theory. 2013, Vol 59, Num 6, pp 3269-3281, issn 0018-9448, 13 p.Article

Algebraic Decoding of a Class of Binary Cyclic Codes Via Lagrange Interpolation FormulaCHANG, Yaotsu; LEE, Chong-Dao.IEEE transactions on information theory. 2010, Vol 56, Num 1, pp 130-139, issn 0018-9448, 10 p.Article

A type of recurring relations on sequences and efficient decoding of a class of algebraic-geometric codesBAO LI; XIAO, G.-Z.IEEE international symposium on information theory. 1998, isbn 0-7803-5000-6, p. 94Conference Paper

An algorithm for shifted continued fraction expansions in parallel linear timeNIEDERREITER, H; VIELHABER, M.Theoretical computer science. 1999, Vol 226, Num 1-2, pp 93-104, issn 0304-3975Article

Fast Chase Decoding Algorithms and Architectures for Reed-Solomon CodesYINGQUAN WU.IEEE transactions on information theory. 2012, Vol 58, Num 1, pp 109-129, issn 0018-9448, 21 p.Article

Skew-Feedback Shift-Register Synthesis and Decoding Interleaved Gabidulin CodesSIDORENKO, Vladimir; LAN JIANG; BOSSERT, Martin et al.IEEE transactions on information theory. 2011, Vol 57, Num 2, pp 621-632, issn 0018-9448, 12 p.Article

Block diagonalization and LU-equivalence of Hankel matricesBEN ATTI, Nadia; DIAZ-TOCA, Gema M.Linear algebra and its applications. 2006, Vol 412, Num 2-3, pp 247-269, issn 0024-3795, 23 p.Article